Termination Proof Script
Consider the TRS R consisting of the rewrite rule
|
| 1: |
|
f(f(x,a),y) |
→ f(y,f(x,y)) |
|
There are 2 dependency pairs:
|
| 2: |
|
F(f(x,a),y) |
→ F(y,f(x,y)) |
| 3: |
|
F(f(x,a),y) |
→ F(x,y) |
|
Consider the SCC {2,3}.
The constraints could not be solved.
Tyrolean Termination Tool (0.01 seconds)
--- May 4, 2006